Home > Search Results: keywords:"množinové pokrytie"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Ant colony optimization
 Kovács, Peter ; Pangrác, Ondřej (advisor) ; Balko, Martin (referee)
The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulated Annealing, Tabu Search or Greedy algo- rithms. Metaheuristics were compared on three different NP-hard problems. Specificaly, Traveling Salesman Problem, Graph Coloring Problem and Set Covering Problem. Detailed description of implementation of metaheuristics in particular problems can be found in this work. Metaheuristics were com- pared based on cost function and execution time. However, this work tries to identify instances, in which Ant Colony was the best choice. Ant Colony is reliable metaheuristic on large Traveling Salesman or Set Covering problems.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English